Normal view MARC view ISBD view

Algorithmic combinatorics on partial words

By: Blanchet-Sadri, Francine.
Material type: materialTypeLabelBookSeries: Discrete mathematics and its applications.Publisher: Boca Raton: Chapman & Hall/CRC, 2008Description: 385 p.; ill.: 24 cm.ISBN: 9781420060928 .Subject(s): Combinatorial analysis | Computer algorithms | Computer science - Mathematics | Wilf's theorem | Critical factorization theorem | CodingDDC classification: 005.1 Summary: This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words, while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 005.1 BLA (Browse shelf) Available 023769

This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words, while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha